20 research outputs found

    Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study

    Full text link
    A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory graph is a network of theories connected by meaning-preserving theory morphisms that map the formulas of one theory to the formulas of another theory. Theory graphs are in turn well suited for formalizing mathematical knowledge at the most convenient level of abstraction using the most convenient vocabulary. We are interested in the problem of whether a body of mathematical knowledge can be effectively formalized as a theory graph of biform theories. As a test case, we look at the graph of theories encoding natural number arithmetic. We used two different formalisms to do this, which we describe and compare. The first is realized in CTTuqe{\rm CTT}_{\rm uqe}, a version of Church's type theory with quotation and evaluation, and the second is realized in Agda, a dependently typed programming language.Comment: 43 pages; published without appendices in: H. Geuvers et al., eds, Intelligent Computer Mathematics (CICM 2017), Lecture Notes in Computer Science, Vol. 10383, pp. 9-24, Springer, 201

    A Proof Assistant Based Formalisation of a Subset of Sequential Core Erlang

    Get PDF
    We present a proof-assistant-based formalisation of a subset of Erlang, intended to serve as a base for proving refactorings correct. After discussing how we reused concepts from related work, we show the syntax and semantics of our formal description, including the abstractions involved (e.g. the concept of a closure). We also present essential properties of the formalisation (e.g. determinism) along with the summary of their machine-checked proofs. Finally, we prove expression pattern equivalences which can be interpreted as simple local refactorings

    A formalized general theory of syntax with bindings

    Get PDF
    We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying numbers of inputs, quotiented to alpha-equivalence and sorted according to a binding signature. The theory includes a rich collection of properties of the standard operators on terms, such as substitution and freshness. It also includes induction and recursion principles and support for semantic interpretation, all tailored for smooth interaction with the bindings and the standard operators

    Ouabain protects against adverse developmental programming of the kidney

    Get PDF
    The kidney is extraordinarily sensitive to adverse fetal programming. Malnutrition, the most common form of developmental challenge, retards the formation of functional units, the nephrons. The resulting low nephron endowment increases susceptibility to renal injury and disease. Using explanted rat embryonic kidneys, we found that ouabain, the Na,K-ATPase ligand, triggers a calcium–nuclear factor-κB signal, which protects kidney development from adverse effects of malnutrition. To mimic malnutrition, kidneys were serum deprived for 24 h. This resulted in severe retardation of nephron formation and a robust increase in apoptosis. In ouabain-exposed kidneys, no adverse effects of serum deprivation were observed. Proof of principle that ouabain rescues development of embryonic kidneys exposed to malnutrition was obtained from studies on pregnant rats given a low-protein diet and treated with ouabain or vehicle throughout pregnancy. Thus, we have identified a survival signal and a feasible therapeutic tool to prevent adverse programming of kidney development
    corecore